Comparing Channel Assignment Results from IP Algorithm and DCA Heuristic

This note accompanies the DCA algorithm paper [1] by Daniels et. al. This paper presents two channel assignment algorithms, one based on an Integer Programming (IP) model and the other based on a heuristic. The number of channels required to satisfy linearly increasing demand function in the randomly distributed Typev cells are presented here for reuse distances greater than 2 and 3. The results show that the new heuristic closely matches the IP solution in the number of channels required under zero blocking condition. The DCA heuristic is also applied to evaluate the blocking probabilities for demand generated by a two state Markov chain based arrival process and uniformly distributed holding times.